Tiled partial cubes

نویسندگان

  • Bostjan Bresar
  • Wilfried Imrich
  • Sandi Klavzar
  • Henry Martyn Mulder
  • Riste Skrekovski
چکیده

In the quest to better understand the connection between median graphs, triangle-free graphs and partial cubes, a hierarchy of subclasses of partial cubes has been introduced. In this article, we study the role of tiled partial cubes in this scheme. For instance, we prove that

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relations between Median Graphs, Semi-median Graphs and Partial Cubes

A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for isometric subgraphs of hypercubes also known as partial cubes and for median graphs Median graphs which constitute a proper subclass of partial cubes have attracted considerable attention In order to better understand them semi median graphs have been introduced but have...

متن کامل

A marching algorithm for isosurface extraction from face-centered cubic lattices

This work provides a novel method that extracts isosurfaces from face-centered cubic (FCC) lattices. It has been theoretically shown that sampling volumetric data on an FCC lattice tiled with rhombic dodecahedra is more efficient than sampling them on a Cartesian lattice tiled with cubes, in that the FCC lattice can represent the same data set as a Cartesian lattice with the same accuracy, yet ...

متن کامل

Tiling a Rectangle with Polyominoes

A polycube in dimension d is a finite union of unit d-cubes whose vertices are on knots of the lattice Zd . We show that, for each family of polycubes E, there exists a finite set F of bricks (parallelepiped rectangles) such that the bricks which can be tiled by E are exactly the bricks which can be tiled by F . Consequently, if we know the set F , then we have an algorithm to decide in polynom...

متن کامل

Rudolph’s Two Step Coding Theorem and Alpern’s Lemma for R Actions

Rudolph showed that the orbits of any measurable, measure preserving R action can be measurably tiled by 2 rectangles and asked if this number of tiles is optimal for d > 1. In this paper, using a tiling of R by notched cubes, we show that d + 1 tiles suffice. Furthermore, using a detailed analysis of the set of invariant measures on tilings of R by two rectangles, we show that while for R acti...

متن کامل

A characterization of planar partial cubes

Partial cubes have been extensively investigated as well as planar graphs. In this note we introduce an additional topological kind of condition to the Chepoi’s expansion procedure that characterizes planar partial cubes. As a consequence we obtain a characterization of some other planar subclasses of partial cubes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2002